Asynchronous reconfiguration with Byzantine failures

نویسندگان

چکیده

Replicated services are inherently vulnerable to failures and security breaches. In a long-running system, it is, therefore, indispensable maintain reconfiguration mechanism that would replace faulty replicas with correct ones. An important challenge is enable without affecting the availability consistency of replicated data: clients should be able get service even when set being updated. this paper, we address problem in presence Byzantine failures: or may arbitrarily deviate from their expected behavior. We describe generic technique for building asynchronous fault-tolerant reconfigurable objects: can manipulate object data issue calls reaching consensus on current configuration. With help forward-secure digital signatures, our solution makes sure superseded possibly compromised configurations harmless, slow cannot fooled into reading stale data, cause denial by flooding system requests. Our approach modular based dynamic lattice agreement abstraction, discuss how extend implementations large class services.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asynchronous Embryonics with Reconfiguration

As embryonic arrays take inspiration from nature they display biological properties, namely complex structure and fault-tolerance. However, hardware implementations have yet to take advantage of a further biological feature at a fundamental level; asynchronous operation. Scalability and reliability are seen as two areas in which embryonic arrays could benefit from asynchronous design. This pape...

متن کامل

Dynamic Distributed Computing with Byzantine Failures

Byzantine failure tolerance (BFT) is one of the most fundamental problem in distributed computing and has been researched extensively. However, due to the famous impossible result of FLP, there is no perfect way to solve it. Modern BFT protocols are usually proposed with practical assumptions such as partially synchrony, encrypted messages. Yet, designing dynamic BFT system with large number of...

متن کامل

Optimistic Asynchronous Byzantine Agreement

Agreement problems are a fundamental building block for constructing reliable distributed systems. While robust and eÆcient protocols exist in the crash-failure setting, protocols resilient against a Byzantine adversary tend to have problems with either eÆciency or security. This paper proposes an optimistic approach to the Byzantine agreement problem, combining the eÆciency of fully synchronou...

متن کامل

Asynchronous Byzantine Agreement Protocols

A consensus protocol enables a system of n asynchronous processes, some of them faulty, to reach agreement. Both the processes and the message system are capable of cooperating to prevent the correct processes from reaching decision. A protocol is t-resilient if in the presence of up to t faulty processes it reaches agreement with probability 1. Byzantine processes are faulty processes that can...

متن کامل

Asynchronous Byzantine Machine Learning

Asynchronous distributed machine learning solutions have proven very effective so far, but always assuming perfectly functioning workers. In practice, some of the workers can however exhibit Byzantine behavior, caused by hardware failures, software bugs, corrupt data, or even malicious attacks. We introduce Kardam, the first distributed asynchronous stochastic gradient descent (SGD) algorithm t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Distributed Computing

سال: 2022

ISSN: ['1432-0452', '0178-2770']

DOI: https://doi.org/10.1007/s00446-022-00421-1